The Data ow Time and Space Complexity of FFTsA
نویسنده
چکیده
In this paper we analyze the performance of a recursive and an iterative Fast Fourier Transform algorithm, written in Id and run on MINT, a simulator for the Monsoon dataaow machine. Our complexity measures are: the number of instructions executed, the critical path length of the dataaow graph, and the storage occupancy. Using a set of simple functions , we calibrate loop and divide-and-conquer behavior of Monsoon, and compare it with the Tagged Token Dataaow Architecture. We discuss the issues in explicit resource management in a functional language, introduce the language features required for this, and show results of our resource managed FFT programs.
منابع مشابه
Time and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کاملTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Binary Decision Diagram (in short BDD) is an efficient data structure which has been used widely in computer science and engineering. BDD-based attack in key stream cryptanalysis is one of the best forms of attack in its category. In this paper, we propose a new key stream attack which is based on ZDD(Zero-suppressed BDD). We show how a ZDD-based key stream attack is more efficient in time and ...
متن کامل2D Computational Fluid Dynamic Modeling of Human Ventricle System Based on Fluid-Solid Interaction and Pulsatile Flow
Many diseases are related to cerebrospinal .uid (CSF) hydrodynamics. Therefore, understanding the hydrodynamics of CSF .ow and intracranial pressure is helpful for obtaining deeper knowledge of pathological processes and providing better treatments. Furthermore, engineering a reliable computational method is promising approach for fabricating in vitro models which is essential for inventing gen...
متن کاملA Novel Method for Detection of Epilepsy in Short and Noisy EEG Signals Using Ordinal Pattern Analysis
Introduction: In this paper, a novel complexity measure is proposed to detect dynamical changes in nonlinear systems using ordinal pattern analysis of time series data taken from the system. Epilepsy is considered as a dynamical change in nonlinear and complex brain system. The ability of the proposed measure for characterizing the normal and epileptic EEG signals when the signal is short or is...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کامل